Operator Precedence ω-Languages
نویسندگان
چکیده
Recent literature extended the analysis of ω-languages from the regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator precedence languages (OPLs), instead, were originally defined to support deterministic parsing and exhibit interesting relations with these classes of languages: OPLs strictly include VPLs, enjoy all relevant closure properties and have been characterized by a suitable automata family and a logic notation. We introduce here operator precedence ω-languages (ωOPLs), investigating various acceptance criteria and their closure properties. Whereas some properties are natural extensions of those holding for regular languages, others require novel investigation techniques. Applicationoriented examples show the gain in expressiveness and verifiability offered by ωOPLs w.r.t. smaller classes.
منابع مشابه
Operator Precedence \omega-languages
ω-languages are becoming more and more relevant nowadays when most applications are “ever-running”. Recent literature, mainly under the motivation of widening the application of model checking techniques, extended the analysis of these languages from the simple regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator prece...
متن کاملOperator Precedence Languages: Their Automata-Theoretic and Logic Characterization
Operator precedence languages were introduced half a century ago by Robert Floyd to support deterministic and efficient parsing of context-free languages. Recently, we renewed our interest in this class of languages thanks to a few distinguishing properties that make them attractive for exploiting various modern technologies. Precisely, their local parsability enables parallel and incremental p...
متن کاملFloyd Languages for Infinite Words Linguaggi Di Floyd per Parole Infinite
Nowadays many software systems are designed to work without interruption: for instance operating systems are required to provide continuously their services to the users, and web applications and verification of critical and concurrent systems represent a typical scenario where endless computations are involved. The behavior of systems operating forever can be formally specified by means of ω-l...
متن کاملHigher-order Operator Precedence Languages
Floyd’s Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenation and star; they properly include the family of Visibly Pushdown (or Input Driven) languages. OP languages are based on three relations between an...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کامل